Saket, Rishi : rechercher sur Z-Library

Le plus grand référentiel d'articles scientifiques au monde. 70,000,000+ d'articles gratuitement.

Don't use scam websites

Livres
Articles (17)
Les plus populaires
Liste
- Liste
- Tableau

1

On the hardness of learning intersections of two halfspaces

Subhash Khot, Rishi Saket

Journal:

Journal of Computer and System Sciences

Année:

2011

Langue:

english

Fichier:

PDF, 232 KB

english, 2011

2

Hardness of Reconstructing Multivariate Polynomials over Finite Fields

Gopalan, Parikshit, Khot, Subhash, Saket, Rishi

Journal:

SIAM Journal on Computing

Année:

2010

Langue:

english

Fichier:

PDF, 337 KB

english, 2010

3

[IEEE 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS) - New Brunswick, NJ, USA (2012.10.20-2012.10.23)] 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science - Hardness of Finding Independent Sets in Almost q-Colorable Graphs

Khot, Subhash, Saket, Rishi

Année:

2012

Langue:

english

Fichier:

PDF, 296 KB

english, 2012

4

[IEEE 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) - Providence, RI, USA (2007.10.21-2007.10.23)] 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) - Hardness of Reconstructing Multivariate Polynomials over Finite Fields

Gopalan, Parikshit, Khot, Subhash, Saket, Rishi

Année:

2007

Langue:

english

Fichier:

PDF, 380 KB

english, 2007

5

[IEEE 2014 IEEE Conference on Computational Complexity (CCC) - Vancouver, BC, Canada (2014.6.11-2014.6.13)] 2014 IEEE 29th Conference on Computational Complexity (CCC) - Hardness of Finding Independent Sets in 2-Colorable Hypergraphs and of Satisfiable CSPs

Année:

2014

Langue:

english

Fichier:

PDF, 309 KB

english, 2014

6

[IEEE 2009 IEEE 50th Annual Symposium on Foundations of Computer Science (FOCS) - Atlanta, GA, USA (2009.10.25-2009.10.27)] 2009 50th Annual IEEE Symposium on Foundations of Computer Science - SDP Integrality Gaps with Local ell_1-Embeddability

Khot, Subhash, Saket, Rishi

Année:

2009

Langue:

english

Fichier:

PDF, 313 KB

english, 2009

7

[IEEE 2013 IEEE Conference on Computational Complexity (CCC) - Stanford, CA, USA (2013.06.5-2013.06.7)] 2013 IEEE Conference on Computational Complexity - Optimal Inapproximability for Scheduling Problems via Structural Hardness for Hypergraph Vertex Cover

Sachdeva, Sushant, Saket, Rishi

Année:

2013

Langue:

english

Fichier:

PDF, 279 KB

english, 2013

8

[IEEE 2008 IEEE 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS) - Philadelphia, PA, USA (2008.10.25-2008.10.28)] 2008 49th Annual IEEE Symposium on Foundations of Computer Science - Hardness of Minimizing and Learning DNF Expressions

Khot, Subhash, Saket, Rishi

Année:

2008

Langue:

english

Fichier:

PDF, 364 KB

english, 2008

9

Inapproximability of Minimum Vertex Cover on $k$-Uniform $k$-Partite Hypergraphs

Guruswami, Venkatesan, Sachdeva, Sushant, Saket, Rishi

Journal:

SIAM Journal on Discrete Mathematics

Année:

2015

Langue:

english

Fichier:

PDF, 302 KB

english, 2015

10

[ACM Press the thirty-eighth annual ACM symposium - Seattle, WA, USA (2006.05.21-2006.05.23)] Proceedings of the thirty-eighth annual ACM symposium on Theory of computing - STOC '06 - Integrality gaps for sparsest cut and minimum linear arrangement problems

Devanur, Nikhil R., Khot, Subhash A., Saket, Rishi, Vishnoi, Nisheeth K.

Année:

2006

Langue:

english

Fichier:

PDF, 265 KB

english, 2006

11

[ACM Press the 40th annual ACM symposium - Victoria, British Columbia, Canada (2008.05.17-2008.05.20)] Proceedings of the fourtieth annual ACM symposium on Theory of computing - STOC 08 - On hardness of learning intersection of two halfspaces

Khot, Subhash, Saket, Rishi

Année:

2008

Langue:

english

Fichier:

PDF, 237 KB

english, 2008

12

[IEEE 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS) - Berkeley, CA (2015.10.17-2015.10.20)] 2015 IEEE 56th Annual Symposium on Foundations of Computer Science - Tight Hardness of the Non-commutative Grothendieck Problem

Briot, Jop, Regev, Oded, Saket, Rishi

Année:

2015

Langue:

english

Fichier:

PDF, 303 KB

english, 2015

13

[IEEE 2014 IEEE 55th Annual Symposium on Foundations of Computer Science (FOCS) - Philadelphia, PA, USA (2014.10.18-2014.10.21)] 2014 IEEE 55th Annual Symposium on Foundations of Computer Science - Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with exp(log^{Omega(1)} n) Colors

Khot, Subhash, Saket, Rishi

Année:

2014

Langue:

english

Fichier:

PDF, 352 KB

english, 2014

14

[IEEE 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) - Providence, RI, USA (2007.10.21-2007.10.23)] 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) - Hardness of Reconstructing Multivariate Polynomials over Finite Fields

Gopalan, Parikshit, Khot, Subhash, Saket, Rishi

Année:

2007

Langue:

english

Fichier:

PDF, 380 KB

english, 2007

15

On the Approximability of Digraph Ordering

Kenkre, Sreyash, Pandit, Vinayaka, Purohit, Manish, Saket, Rishi

Journal:

Année:

2016

Langue:

english

Fichier:

PDF, 630 KB

english, 2016

16

Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with $2^{(\log {n})^{\Omega(1)}}$ Colors

Khot, Subhash, Saket, Rishi

Journal:

SIAM Journal on Computing

Année:

2017

Langue:

english

Fichier:

PDF, 434 KB

english, 2017

17

[IEEE 2020 IEEE International Conference on Blockchain and Cryptocurrency (ICBC) - Toronto, ON, Canada (2020.5.2-2020.5.6)] 2020 IEEE International Conference on Blockchain and Cryptocurrency (ICBC) - Smart Contract Protocol for Authenticity and Compliance with Anonymity on Hyperledger Fabric

Saket, Rishi, Singh, Nitin, Dayama, Pankaj, Pandit, Vinayaka

Année:

2020

Fichier:

PDF, 474 KB

2020